Simple Failure Resilient Load Balancing
نویسندگان
چکیده
To enable reliable data delivery and balance load in the presence of failures, we propose a new mechanism that combines path protection and traffic engineering. The key benefit of our solution is its simplicity, allowing for fast recovery while imposing minimal requirements on the routers. To provide resilience against every failure scenario from a known set, we advocate using a fixed set of parallel end-to-end paths for each traffic demand. Upon detecting a path failure, the ingress router uses a local rule to rebalance the outgoing traffic on the remaining available paths. We describe several candidate rebalancing algorithms, and analyze their performance. Although calculating the optimal set of paths and the path-splitting parameters for each router is NP-hard, our extensive simulations on a tier-1 IP backbone demonstrate that our easy-to-calculate heuristic suffices to achieve nearly optimal load balancing. We believe that a simple-to-implement solution with a fast recovery time, such as ours, will appeal to Internet Service Providers as well as the operators of data centers and enterprise networks.
منابع مشابه
Let It Flow: Resilient Asymmetric Load Balancing with Flowlet Switching
Datacenter networks require efficient multi-path load balancing to achieve high bisection bandwidth. Despite much progress in recent years towards addressing this challenge, a load balancing design that is both simple to implement and resilient to network asymmetry has remained elusive. In this paper, we show that flowlet switching, an idea first proposed more than a decade ago, is a powerful t...
متن کاملSHAM: Scalable Homogeneous Addressing Mechanism for structured P2P networks
In designing structured P2P networks, scalability, resilience, and load balancing are features that are needed to be handled meticulously. The P2P overlay has to handle large scale of nodes while maintaining minimized path lengths in performing lookups. It has also to be resilient to nodes’ failure and be able to distribute the load uniformly over its participant. In this paper, we introduce SH...
متن کاملRouting Algorithms in Resilient Packet Rings
-The Resilient Packet Ring (RPR) is a data ring network, where one of the key issues is on a load balancing for competing streams of elastic traffic. This paper suggests efficient routing algorithms on the RPR. For the algorithms, we evaluate their efficiency via simulation. Key-Words: Resilient Packet Ring, Unsplit Loading, Heuristic Algorithm, Simulation
متن کاملLoad Balancing in Peer-to-Peer Systems
Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challeng...
متن کاملSelf-Protecting Multipaths - A Simple and Resource-Efficient Protection Switching Mechanism for MPLS Networks
In this paper we propose the concept of an end-to-end (e2e) SelfProtecting Multi-Path (SPM) as a protection switching mechanism that may be implemented, e.g., in Multiprotocol Label Switching (MPLS) networks. In case of local outages, resilient networks redirect the traffic from a failed link over an e2e backup path to its destination. In this case, Quality of Service (QoS) can only be provided...
متن کامل